Space-efficient algorithms for computing minimal/shortest unique substrings

Efficient Data Mining with Evolutionary Algorithms for Cloud Computing Application

With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...

efficient data mining with evolutionary algorithms for cloud computing application

with the rapid development of the internet, the amount of information and data which are produced, are extremely massive. hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. data mining can overcome this problem. while data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. as the speed of ...

Minimum Unique Substrings and Maximum Repeats

Unique substrings appear scattered in the stringology literature and have important applications in bioinformatics. In this paper we initiate a study of minimum unique substrings in a given string; that is, substrings that occur exactly once while all their substrings are repeats. We discover a strong duality between minimum unique substrings and maximum repeats which, in particular, allows fas...

Efficient Algorithms for Computing the beta-spectrum

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(n log n+n log...